Search Pathology of 8-puzzle
نویسندگان
چکیده
8-puzzle is typically solved by heuristic search. Real-time heuristic search usually gives better results when searching deeper. But sometimes deeper search leads to worse results than shallower which is a phenomenon called search pathology. In this paper we present the results of our investigation of the causes for pathology in 8-puzzle and some of its variations.
منابع مشابه
The pathology of heuristic search in the 8-puzzle
In practice, an incomplete heuristic search nearly always finds better solutions if it is allowed to search deeper, i.e., expand and heuristically evaluate more nodes in the search tree. On the rare occasions when searching deeper is not beneficial, a curious phenomenon called “search pathology” occurs. In this paper we study the pathology and gain of a deeper search of the minimin algorithm in...
متن کاملExperimental Comparison of Uninformed and Heuristic AI Algorithms for N Puzzle and 8 Queen Puzzle Solution
This paper compares the performance of popular AI techniques, namely the Breadth First Search, Depth First Search, A* Search, Greedy Best First Search and the Hill Climbing Search in approaching the solution of a N-Puzzle of size 8, on a 3x3 matrix board and for the solution of the classic 8 Queen Puzzle. It looks at the complexity of each algorithm as it tries to approaches the solution in ord...
متن کاملA Visual Treatment of the N-Puzzle
Informed search strategies rely on information or heuristics to find the shortest path to the goal. Understanding the intricacies of these search strategies and the heuristics they employ is of great importance to AI research. Visualizations of a search space may provide some insight. However, visualizing large hierarchical data can be challenging. Traditional graph visualizations such as top-d...
متن کاملSolving Square Jigsaw Puzzles Using Dynamic Programming and the Hungarian Procedure
Problem statement: To design, implement, and test an algorithm for solving the square jigsaw puzzle problem, which has many applications in image processing, pattern recognition, and computer vision such as restoration of archeological artifacts and image descrambling. Approach: The algorithm used the gray level profiles of border pixels for local matching of the puzzle pieces, which was perfor...
متن کاملComplete Solution of the Eight-Puzzle and the Benefit of Node Ordering in IDA
The 8-puzzle is the largest puzzle of its type that can be completely solved. It is simple, and yet obeys a combinatorially large problem space of 9!/2 states. The N x N extension of the 8-puzzle is NP-hard. In the first part of this paper, we present complete statistical data based on an exhaustive evaluation of all possible tile configurations. Our results include data on the expected solutio...
متن کامل